Fast Walsh–Hadamard–Fourier Transform Algorithm
نویسندگان
چکیده
منابع مشابه
Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT's in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from -1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT...
متن کاملThe Cooley - Tukey Fast Fourier Transform Algorithm ∗
The publication by Cooley and Tukey [5] in 1965 of an e cient algorithm for the calculation of the DFT was a major turning point in the development of digital signal processing. During the ve or so years that followed, various extensions and modi cations were made to the original algorithm [6]. By the early 1970's the practical programs were basically in the form used today. The standard develo...
متن کاملFIHT2 Algorithm: A Fast Incremental Hough Transform
FIHT2 algorithm defined by p = x . cos 0 + y .sin 0 + (a/(21()) . x . s ine at 0 5 6 < a / 2 and at p = x . cose + y . sin 0 + (aJ(2It')) . y . cos 0 at a / 2 5 0 < a is a Hough transform which requires nothing of the trigonometric and functional operations to generate the Hough distributions. It is demonstrated in this paper that the FIHT2 is a complete alternative of the usual Hough transform...
متن کاملA fast spherical harmonics transform algorithm
The spectral method with discrete spherical harmonics transform plays an important role in many applications. In spite of its advantages, the spherical harmonics transform has a drawback of high computational complexity, which is determined by that of the associated Legendre transform, and the direct computation requires time of O(N3) for cut-off frequency N . In this paper, we propose a fast a...
متن کاملAn Equivariant Fast Fourier Transform Algorithm
This paper presents a generalization of the Cooley-Tukey fast Fourier transform algorithm that respects group symmetries. The algorithm, when applied to a function invariant under a group of symmetries, fully exploits these symmetries to reduce both the number of arithmetic operations and the amount of memory used. The symmetries accommodated by the algorithm include all of the crystallographic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2011
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2011.2162836